Succinctness and tractability of closure operator representations
نویسندگان
چکیده
منابع مشابه
Succinctness and tractability of closure operator representations
It is widely known that closure operators on finite sets can be represented by sets of implications (also known as inclusion dependencies) as well as by formal contexts. In this article, we consider these two representation types, as well as generalizations of them: extended implication sets and context families. We discuss the mutual succinctness of these four representations and the tractabil...
متن کاملcompactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولL-fuzzy Closure Operator
The aim of this paper is to study L-fuzzy closure operator in Lfuzzy topological spaces. We introduce two kinds of L-fuzzy closure operators from different point view and prove that both L-TFCS–the category of topological L-fuzzy closure spaces–and L-PTFCS–the category of topological pointwise L-fuzzy closure spaces–are isomorphic to L-FCTOP.
متن کاملcient Closure Representations
Many modern compilers implement function calls (or returns) in two steps: rst, a closure environment is properly installed to provide access for free variables in the target program fragment; second, the control is transferred to the target by a \jump with arguments (or results)." Closure conversion, which decides where and how to represent closures at runtime, is a crucial step in compilation ...
متن کاملRepresentations of structural closure operators
We continue the work of Blok and Jónsson by developing the theory of structural closure operators and introducing the notion of a representation between them. Similarities and equivalences of Blok-Jónsson turn out to be bijective representations and bijective structural representations, respectively. We obtain a characterization for representations induced by a transformer. In order to obtain a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.12.028